Constraint-based Preferential Optimization
ثبت نشده
چکیده
We first show that the optimal and undominated outcomes of an unconstrained (and possibly cyclic) CP-net are the solutions of a set of hard constraints. We then propose a new algorithm for finding the optimal outcomes of a constrained CP-net which makes use of hard constraint solving. Unlike previous algorithms, this new algorithm works even with cyclic CP-nets. In addition, the algorithm is not tied to CP-nets, but can work with any preference formalism which produces a preorder over the outcomes. We also propose an approximation method which weakens the preference ordering induced by the CP-net, returning a larger set of outcomes, but provides a significant computational advantage. Finally, we describe a weighted constraint approach that allows to find good solutions even when optimals do not exist.
منابع مشابه
A Chance Constraint Approach to Multi Response Optimization Based on a Network Data Envelopment Analysis
In this paper, a novel approach for multi response optimization is presented. In the proposed approach, response variables in treatments combination occur with a certain probability. Moreover, we assume that each treatment has a network style. Because of the probabilistic nature of treatment combination, the proposed approach can compute the efficiency of each treatment under the desirable reli...
متن کاملSEQUENTIAL PENALTY HANDLING TECHNIQUES FOR SIZING DESIGN OF PIN-JOINTED STRUCTURES BY OBSERVER-TEACHER-LEARNER-BASED OPTIMIZATION
Despite comprehensive literature works on developing fitness-based optimization algorithms, their performance is yet challenged by constraint handling in various engineering tasks. The present study, concerns the widely-used external penalty technique for sizing design of pin-jointed structures. Observer-teacher-learner-based optimization is employed here since previously addressed by a number ...
متن کاملConstraint-Based Preferential Optimization
We first show that the optimal and undominated outcomes of an unconstrained (and possibly cyclic) CP-net are the solutions of a set of hard constraints. We then propose a new algorithm for finding the optimal outcomes of a constrained CPnet which makes use of hard constraint solving. Unlike previous algorithms, this new algorithm works even with cyclic CP-nets. In addition, the algorithm is not...
متن کاملAn effective method based on the angular constraint to detect Pareto points in bi-criteria optimization problems
The most important issue in multi-objective optimization problems is to determine the Pareto points along the Pareto frontier. If the optimization problem involves multiple conflicting objectives, the results obtained from the Pareto-optimality will have the trade-off solutions that shaping the Pareto frontier. Each of these solutions lies at the boundary of the Pareto frontier, such that the i...
متن کاملPreference Logic Programming: Optimization as Inference
Preference Logic Programming (PLP) is an extension of Constraint Logic Programming (CLP) for declaratively specifying optimization problems. In the PLP framework, the deenite clauses of a CLP program are augmented by two new kinds of clauses: optimization clauses and arbiter clauses. Optimization clauses specify which predicates are to be optimized and arbiter clauses specify the criteria to be...
متن کاملMulti-Criteria Optimization of Temporal Preferences
We propose a new framework for multi-criteria optimization in constraint-based temporal reasoning. Motivated by a real-world domain, we augment one of the most expressive current formalisms, the Disjunctive Temporal Problem with Preferences (DTPP), in two crucial ways. First, we model optimality criteria as being attributed to subsets of soft constraints, in contrast to the direct mapping to in...
متن کامل